Bias Optimal Admission Control Policies for a Multi-Class Non-Stationary Queueing System1
نویسندگان
چکیده
We consider a finite capacity queueing system where arriving customers offer rewards which are paid upon acceptance into the system. The gatekeeper, whose objective is to “maximize” rewards decides if the reward offered is sufficient to accept or reject the arriving customer. Suppose the arrival rates, service rates, and system capacity are changing over time in a known manner. We show that all bias optimal (a refinement of long-run average reward optimal) policies are of threshold form. Furthermore, we give sufficient conditions for the bias optimal policy to be monotonic in time. We show, via a counterexample, that if these conditions are violated, the optimal policy may not be monotonic in time or of threshold form.
منابع مشابه
BIAS OPTIMALITY IN A QUEUE WITH ADMISSION CONTROL yz
We consider a nite capacity queueing system in which each arriving customer o ers a reward. A gatekeeper decides based on the reward o ered and the space remaining whether each arriving customer should be accepted or rejected. The gatekeeper only receives the o ered reward if the customer is accepted. A traditional objective function is to maximize the gain; that is, the long-run average reward...
متن کاملDynamic admission and service rate control of a queue
This paper investigates a queueing system in which the controller can perform admission and service rate control. In particular, we examine a single server queueing system with Poisson arrivals and exponentially distributed services with adjustable rates. At each decision epoch the controller may adjust the service rate. Also, the controller can reject incoming customers as they arrive. The obj...
متن کاملRate Adaptive Multimedia Streams: Optimization, Admission Control, and Distributed Algorithms
This work investigates support of rate adaptive multimedia streams on communication networks. Optimal and practical mechanisms to maximize the customer average QoS, defined in terms of a normalized time average received rate, are established. By scaling the arrival rate and link capacity, we obtain asymptotic expressions for customer average QoS in the case of networks with single bottleneck li...
متن کاملOptimal Pricing and Admission Control in a Queueing System with Periodically Varying Parameters
We consider congestion control in a nonstationary queueing system. Assuming that the arrival and service rates are bounded, periodic functions of time, a Markov decision process (MDP) formulation is developed. We show under the infinite horizon discounted and average reward optimality criteria, for each fixed time, optimal pricing and admission control strategies are nondecreasing in the number...
متن کاملAsymptotically Optimal Control for a Multiclass Queueing Model in the Moderate Deviation Heavy Traffic Regime1 by Rami Atar
A multi-class single-server queueing model with finite buffers, in which scheduling and admission of customers are subject to control, is studied in the moderate deviation heavy traffic regime. A risk-sensitive cost set over a finite time horizon [0, T ] is considered. The main result is the asymptotic optimality of a control policy derived via an underlying differential game. The result is the...
متن کامل